Asymptotic Behavior and the Cauchy Problem for Ultrahyperbolic Operators
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFactoring Weakly Compact Operators and the Inhomogeneous Cauchy Problem
By using the technique of factoring weakly compact operators through reflexive Banach spaces we prove that a class of ordinary differential equations with Lipschitz continuous perturbations has a strong solution when the problem is governed by a closed linear operator generating a strongly continuous semigroup of compact operators.
متن کاملOn the asymptotic behavior of odd operators
We give quantitative versions of strong convergence results due to Baillon, Bruck and Reich for iterations of nonexpansive odd (and more general) operators in uniformly convex Banach spaces.
متن کاملExistence, global nonexistence, and asymptotic behavior of solutions for the Cauchy problem of a multidimensional generalized damped Boussinesq-type equation
where u (x, t) denotes the unknown function, f (s) is the given nonlinear function, u0 (x) and u1 (x) are the given initial value functions, k is a constant, the subscript t indicates the partial derivative with respect to t, n is the dimension of space variable x, and △ denotes the Laplace operator in R. The effects of small nonlinearity and dispersion are taken into consideration in the deriv...
متن کاملAsymptotic behavior of the quadratic knapsack problem
We study subclasses of the quadratic knapsack problem, where the profits are independent random variables defined on the interval [0, 1] and the knapsack capacity is proportional to the number of items (we assume that the weights are arbitrary numbers from the interval [0, 1]). We show asymptotically that the objective value of a very easy heuristic is not far away from the optimal solution. Mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1974
ISSN: 0022-2518
DOI: 10.1512/iumj.1975.24.24009